Computing the nucleolus of weighted cooperative matching games in polynomial time
نویسندگان
چکیده
منابع مشابه
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
We provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game. This resolves a long-standing open question of [Kern and Paulusma, Mathematics of Operations Research, 2003].
متن کاملComputing the nucleolus of weighted voting games
Weighted voting games (WVG) are coalitional games in which an agent’s contribution to a coalition is given by his weight, and a coalition wins if its total weight meets or exceeds a given quota. These games model decision-making in political bodies as well as collaboration and surplus division in multiagent domains. The computational complexity of various solution concepts for weighted voting g...
متن کاملComputing the Nucleolus of Matching, Cover and Clique Games
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable solution for the grand coalition. We study the computation of the nucleolus of a number of cooperative games, including fractional matching games and fractional edge cover games on general weighted graphs, as well as verte...
متن کاملThe G-nucleolus for fuzzy cooperative games
In this paper we deal with the problem of extending the concept of nucleolus on fuzzy cooperative games. Described a newly invented definition of nucleolus for fuzzy cooperative games. We prove that the newly defined nucleolus on the set of classical cooperative games coincides with the previously existing one. It is proved that for separate classes of fuzzy games the nucleolus exists and uniqu...
متن کاملA polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure
Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many such allocation problems there is some hierarchical ordering of the players. In this paper we consider a class of games with a permission structure describing situations in which players in a cooperative TU-game are hierarchically ordered in the sense that there are players that nee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2020
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-020-01483-4